PushPush-k is PSPACE-Complete
نویسندگان
چکیده
We prove that a pushing-block puzzle called PUSHPUSH-k is PSPACE-complete for any fixed k ≥ 1. In this puzzle, a robot moves on a finite grid. Each grid position is either empty or occupied by a single obstacle block. While moving, the robot may push obstacle blocks in direction of its movement, subject to certain constraints. In particular, once an obstacle block starts moving, it continues to do so until it hits another obstacle or the grid boundary. The problem is to decide whether the robot can navigate from a given start position to a specified goal position on the grid.
منابع مشابه
Motion planning with pull moves
Sokoban is a game on an integer grid, where a warehouse keeper, or robot, has to push boxes to designated storage locations. He can push a box one cell horizontally or vertically if the destination cell is free. Some of the grid cells can be occupied by unmovable obstacles. Several variants of Sokoban have been studied. In these variants all obstacles may be movable, the keeper may push up to k...
متن کاملMultinational War is Hard
In this paper, we show that the problem of determining whether one player can force a win in a multiplayer version of the children’s card game War is pspace-hard. The same reduction shows that a related problem, asking whether a player can survive k rounds, is pspace-complete when k is polynomial in the size of the input.
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملDeciding the On-line Chromatic Number of a Graph with Pre-coloring Is PSPACE-Complete
The problem of determining if the on-line chromatic number of a graph is less than or equal to k, given a pre-coloring, is shown to be PSPACE-complete.
متن کاملDeciding the K-Dimension is PSPACE-Complete
In 1988 Littlestone introduced the optimal mistake-bound learning model to learning theory. In this model the difficulty of learning a concept from a concept class is measured by the K-dimension of the concept class, which is a purely combinatorial notion. This is similar to the situation in PAC-learning, where the difficulty of learning can be measured by the Vapnik-Červonenkis dimension. We s...
متن کامل